Some Theorems Concerning the Free Energy of (Un)Constrained Stochastic Hop eld Neural Networks
نویسندگان
چکیده
General stochastic binary Hop eld models are viewed from the angle of statistical mechanics. Both the general unconstrained binary stochastic Hop eld model and a certain constrained one are analyzed yielding explicit expressions of the free energy. Moreover, conditions are given for which some of these free energy expressions are Lyapunov functions of the corresponding di erential equations. In mean eld approximation, either stochastic model appears to coincide with a speci c continuous model. Physically, the models are related to spin and to Potts glass models. By means of an alternative derivation, an expression of a `complementary' free energy is presented. Some surveying computational results are reported and an alternative use of the discussed models in resolving constrained optimization problems is discussed. 1 Unconstrained Stochastic Hop eld Networks 1.1 The Background: Classical Hop eld Networks In 1982 Hop eld introduced the idea of an `energy function' into neural network theory using an asynchronous updating rule and binary units [6]. He used the following expression of the energy: E(S) = 1 2 X ij wijSiSj IiSi; (1) where S 2 f0; 1g is the state vector (S1; ; Sn) of the neural network, Si the output value and Ii the external input of neuron i, and where wij represents the interconnection strength from neuron j to neuron i. In 1984, he generalized the stochastic model to a deterministic one with continuous-valued units [7]. Hop eld used the well known updating rule _ Ui = @EHM (V) @Vi = X j wijVj + Ii Ui; (2) keeping always Vi = g(Ui). Essentially, this is a parallel gradient descent method. 1 There exist other algorithms to nd an equilibrium point of the neural network like V new i = g( P j wijV old j + Ii). However, those are not analyzed here. The corresponding energy function is EHM (V) = 1 2 X
منابع مشابه
On the Statistical Mechanics of (un)constrained Stochastic Hoppeld And`elastic' Neural Networks 1 Motivation and Results 2 Unconstrained Stochastic Hoppeld Networks 2.1 the Background: Classical Hoppeld Networks
Stochastic binary Hoppeld models are viewed from the angle of statistical mechanics. After an analysis of the unconstrained model using mean eld theory, a similar investigation is applied to a constrained model yielding comparable general explicit formulas of the free energy. Conditions are given for which some of the free energy expressions are Lyapunov functions of the corresponding diierenti...
متن کاملGeneralized Hop eld Networks for Constrained Optimization
A twofold generalization of the classical continuous Hop eld neural network for modelling constrained optimization problems is proposed. On the one hand, non-quadratic cost functions are admitted corresponding to non-linear output summation functions in the neurons. On the other hand it is shown under which conditions various (new) types of constraints can be incorporated directly. The stabilit...
متن کاملLEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks
A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...
متن کاملHop eld Networks for Solving Tower of Hanoi Problem
In this paper, Hop eld neural networks have been considered in solving tower of Hanoi test which is used in determining of de cit of planning capability of human prefrontal cortex. The main di erence of this work from the ones in the literature which use neural networks, is: The tower of Hanoi problem has been formulated here as a special shortest path problem. In the literature, some Hop eld n...
متن کاملCompetitive neural network to solve scheduling problems
Most scheduling problems have been demonstrated to be NP-complete problems. The Hop"eld neural network is commonly applied to obtain an optimal solution in various di!erent scheduling applications, such as the traveling salesman problem (TSP), a typical discrete combinatorial problem. Hop"eld neural networks, although providing rapid convergence to the solution, require extensive e!ort to deter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998